Using Rademacher permutations to reduce randomness
نویسندگان
چکیده
منابع مشابه
Using Rademacher Permutations to Reduce Randomness
It is shown how a special family of unitary operators, called the Rademacher permutations and related to the Clifford algebra, can be used to reduce the level of randomness in several results in asymptotic geometric analysis. §
متن کاملUsing Markov Chains to Reduce Randomness
1 Useful Linear Algebra Let v = (v1, v2, . . . , vn) be a non-zero n-dimensional row vector and P an n× n matrix. • We say v is an eigenvector of P with corresponding eigenvalue λ iff vP = λv. • The L1-norm of v (denoted ‖v‖1) is ∑n i=1 vi. • The L2-norm of v (denoted ‖v‖2) is √∑n i=1 v 2 i . • The inner product of two vectors v and w (denoted v ·w) is ∑n i=1 viwi. • We say vectors v,v, . . .v ...
متن کاملIncreasing Randomness Using Permutations on Blocks
Introduction Pseudorandom sequences that are algorithmically produced have limited cryptographic applications because the eavesdropper can readily generate them. The complexity of the generation process and the lack of correlation amongst the bits (or digits) of the sequence are important in determining the usefulness of a pseudorandom sequence. A quantum mechanical process can be used to gener...
متن کاملPolynomial-Time Rademacher Theorem, Porosity and Randomness
The main result of this paper is a polynomial time version of Rademacher’s theorem. We show that if z ∈ R is p-random, then every polynomial time computable Lipschitz function f : R → R is differentiable at z. This is a generalization of the main result of [19]. To prove our main result, we introduce and study a new notion, p-porosity, and prove several results of independent interest. In parti...
متن کاملClosure of Resource-Bounded Randomness Notions Under Polynomial-Time Permutations
An infinite bit sequence is called recursively random if no computable strategy betting along the sequence has unbounded capital. It is wellknown that the property of recursive randomness is closed under computable permutations. We investigate analogous statements for randomness notions defined by betting strategies that are computable within resource bounds. Suppose that S is a polynomial time...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: St. Petersburg Mathematical Journal
سال: 2007
ISSN: 1061-0022
DOI: 10.1090/s1061-0022-07-00983-1